OT系统的可复用站场图的设计与实现

目前,操作员终端(OT)系统需要根据特定的站场图去开发特定的系统。为解决上述问题,根据OT系统的开发需求,本文介绍了一种可复用的OT系统站场图的实现方法。该方法基于XML技术和组件化程序思想,能有效的缩短了OT仿真系统的开发周期,简化开发过程。采用这种方法的操作员终端系统无需重新编译就可以自动适应不同的线路情况。     

基于键合图模型的新型解析冗余关系故障诊断方法研究

研究了通过诊断键合图模型建立系统解忻冗余关系(ARRs)的故障诊断方法.通过在系统键合图中加入虚拟传感器的方法建立系统的诊断键合图,根据诊断键合图模型的因果关系路径构建系统的解析冗余关系和系统故障特征矩阵,并利用系统实际观测特征与故障特征的比较进行系统的故障检测和隔离,通过在双容水箱系统的仿真验证,证明了该方法便捷性和...     

最小生成树算法在旅行商问题中的应用

如何在n个顶点之间的1/2(n-1)!巡回路径中选择距离最短的,这是一个典型的组合优化问题,也是解决旅行商问题的根本.在最小生成树的基本思想上进行了改进,成功地解决了旅行商问题.     

Workflow simulation for operational decision support using event graph through process mining

It is increasingly common to see computer-based simulation being used as a vehicle to model and analyze business processes in relation to process management and improvement. While there are a number of business process management (BPM) and business process simulation (BPS) methodologies, approaches and tools available, it is more desirable to have a systemic BPS approach for operational decision support, from constructing process models based on historical data to simulating processes for typical and common problems. In this paper, we have proposed a generic approach of BPS for operational decision support which includes business processes modeling and workflow simulation with the models generated. Processes are modeled with event graphs through process mining from workflow logs that have integrated comprehensive information about the control-flow, data and resource aspects of a business process. A case study of a credit card application is presented to illustrate the steps involved in constructing an event graph. The evaluation detail is also given in terms of precision, generalization and robustness. Based on the event graph model constructed, we simulate the process under different scenarios and analyze the simulation logs for three generic problems in the case study: 1) suitable resource allocation plan for different case arrival rates; 2) teamwork performance under different case arrival rates; and 3) evaluation and prediction for personal performances. Our experimental results show that the proposed approach is able to model business processes using event graphs and simulate the processes for common operational decision support which collectively play an important role in process management and improvement.     

A systematic approach to integrate common timed security rules within a TEFSM-based system specification

Context

Formal methods are very useful in the software industry and are becoming of paramount importance in practical engineering techniques. They involve the design and modeling of various system aspects expressed usually through different paradigms. These different formalisms make the verification of global developed systems more difficult.

Objective

In this paper, we propose to combine two modeling formalisms, in order to express both functional and security timed requirements of a system to obtain all the requirements expressed in a unique formalism.

Method

First, the system behavior is specified according to its functional requirements using Timed Extended Finite State Machine (TEFSM) formalism. Second, this model is augmented by applying a set of dedicated algorithms to integrate timed security requirements specified in Nomad language. This language is adapted to express security properties such as permissions, prohibitions and obligations with time considerations.

Results

The proposed algorithms produce a global TEFSM specification of the system that includes both its functional and security timed requirements.

Conclusion

It is concluded that it is possible to merge several requirement aspects described with different formalisms into a global specification that can be used for several purposes such as code generation, specification correctness proof, model checking or automatic test generation. In this paper, we applied our approach to a France Telecom Travel service to demonstrate its scalability and feasibility.     

Routing with multiple quality-of-services constraints: An approximation perspective

Finding a path that satisfies multiple Quality-of-Service (QoS) constraints is vital to the deployment of current emerged services. However, existing algorithms are not very efficient and effective at finding such a path. Moreover, few works focus on three or more QoS constraints. In this paper, we present an enhanced version of fully polynomial time approximation scheme (EFPTAS) for multiconstrainted path optimal (MCOP) problem. Specifically, we make four major contributions. We first allow the proposed algorithm to construct an auxiliary graph, through which the QoS parameters on each of the finding path can be guaranteed not to exceed the given constraints. Then we adopt a concept, called nonlinear definition of path constraints in EFPTAS for reducing both time and space complexity. Also, we enable EFPTAS to run iteratively to facilitate a progressive refinement of the finding result. In addition to these, we identify some “deployment” issues for proposed algorithm, the essential steps that how and when the EFPTAS takes place are presented. By analyzing the proposed algorithm theoretically, we find that the presented EFPTAS can find a (1+ε)-approximation path in the network with time complexity O(|E||V|/ε) (where |E| is the number of edges and |V| is the number of nodes), which outperforms the previous best-known algorithm for MCOP. We conduct an extensive comparison between the algorithm presented in this paper and previous best-known study experimentally, our results indicate that EFPTAS can find a path with low complexity and preferable quality.     

扩展汉明码的交织重排算法研究及其实现

从信道纠错编码的基本思想出发,讨论了汉明码、扩展汉明码以及交织的纠错检错能力,提出了对扩展汉明码进行交织重排的算法.然后采用C语言对该算法进行程序设计,验证了该算法的可行性.结果表明:此种算法具有较强的抗干扰能力,提高了传输数据的可靠性.     

基于VC＋＋的SEGY数据格式地震剖面图绘制

地震数据显示是地震资料解释的基础,将数据转换为图形的形式在屏幕上显示出来可以使其更加直观、易于理解。本文在分析了SEGY格式地震数据文件结构的基础上,利用VC＋＋实现了地震数据的准确读取,完成了波形、面积填充和变密度这几种常见地震数据剖面显示方式的绘制。对绘制的原理和过程进行了介绍,并展示了绘制结果。     

利用二进制数算法寻找5个点的Ramsey图

用二进制数来表示完全图的各种组合,借助计算机编程可从完全图的各种组合中寻找出ramsey图.5个顶点的Ramsey图是最基本的Ramsey图,这种基本方法为寻找更复杂的Ramsey图提供了基础.     

一种多学科设计优化工作流验证方法

在多学科设计优化集成系统中,设计过程和优化求解算法均通过可视化工作流实现,工作流有效性验证对提高设计效率和提高系统的用户体验具有重要意义。当前验证方法主要针对办公自动和企业管理系统中的工作流验证问题,多学科设计优化集成系统中的工作流验证问题研究较少。在分析前期工作验证技术的基础上,针对以循环结构为特征的优化环,提出一种基于图论方法的,名为浓缩环(concentration-loop)的验证算法。结合发射平台数字化设计系统的设计与实现,对该算法进行了验证。